Countable-compact-covering maps and compact-covering maps

Simplicial ramified covering maps

In this paper we define the concept of a ramified covering map in the category of simplicial sets and we show that it has properties analogous to those of the topological ramified covering maps. We show that the geometric realization of a simplicial ramified covering map is a topological ramified covering map, and we also consider the relation with ramified covering maps in the category of simp...

Universal covering Maps and radial

Covering compact metric spaces greedily

Abstract. A general greedy approach to construct coverings of compact metric spaces by metric balls is given and analyzed. The analysis is a continuous version of Chvátal’s analysis of the greedy algorithm for the weighted set cover problem. The approach is demonstrated in an exemplary manner to construct efficient coverings of the n-dimensional sphere and n-dimensional Euclidean space to give ...

Compact Random Feature Maps

Kernel approximation using random feature maps has recently gained a lot of interest. This is mainly due to their applications in reducing training and testing times of kernel based learning algorithms. In this work, we identify that previous approaches for polynomial kernel approximation create maps that can be rank deficient, and therefore may not utilize the capacity of the projected feature...

Covering dimension and finite-to-one maps

To Ken Kunen on the occasion of his retirement from teaching MSC: primary 54F45 secondary 54C10, 54G05